GENERATING FUNCTIONS FOR PLATEAUS IN MOTZKIN PATHS
نویسندگان
چکیده
منابع مشابه
A half-normal distribution scheme for generating functions and the unexpected behavior of Motzkin paths
We present an extension of a theorem by Michael Drmota and Michèle Soria [Images and Preimages in Random Mappings, 1997] that can be used to identify the limiting distribution for a class of combinatorial schemata. This is achieved by determining analytical and algebraic properties of the associated bivariate generating function. We give sufficient conditions implying a half-normal limiting dis...
متن کاملMotzkin Paths, Motzkin Polynomials and Recurrence Relations
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...
متن کاملWeighted 2-Motzkin Paths
This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch and Elizalde can be used to provide combinatorial interpretations of the identities of Coker when it is applied to weighted plane trees. For the sake of presentation of our combinatorial corresponden...
متن کاملDyck paths , Motzkin paths and traffic jams
It has recently been observed that the normalization of a one-dimensional out-of-equilibrium model, the asymmetric exclusion process (ASEP) with random sequential dynamics, is exactly equivalent to the partition function of a two-dimensional lattice path model of one-transit walks, or equivalently Dyck paths. This explains the applicability of the Lee–Yang theory of partition function zeros to ...
متن کاملRestricted involutions and Motzkin paths
Given a permutation σ ∈ Sn, one can partition the set {1, 2, . . . , n} into intervals A1, . . . , At such that σ(Aj) = Aj for every j. The restrictions of σ to the intervals in the finest of these decompositions are called connected components of σ. A permutation σ with a single connected component is called connected. Given a permutation σ ∈ Sn, we define the reverse of σ to be the permutatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Chungcheong Mathematical Society
سال: 2012
ISSN: 1226-3524
DOI: 10.14403/jcms.2012.25.3.475